Mixed reality depth contour occlusion using binocular similarity matching and three-dimensional contour optimisation

نویسندگان

چکیده

Abstract Mixed reality applications often require virtual objects that are partly occluded by real objects. However, previous research and commercial products have limitations in terms of performance efficiency. To address these challenges, we propose a novel depth contour occlusion (DCO) algorithm. The proposed method is based on the sensitivity binocular stereoscopic vision device. In this method, map combined with sparse obtained from two-stage adaptive filter area stereo matching algorithm extracted digital image stabilisation optical flow method. We also quadratic optimisation model three constraints to generate an accurate dense for high-quality real-virtual occlusion. whole process accelerated GPU. evaluate effectiveness algorithm, demonstrate time consumption statistical analysis each stage DCO execution. verify reliability effect, conduct experimental single-sided, enclosed, complex occlusions. Subsequently, compare it without optimisation. With our GPU implementation real-time DCO, evaluation indicates applying presented enhances visual quality

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contour Matching Using Epipolar Geometry

Generally contour matching is diicult, and the problem becomes more diicult when the motion between successive image frames is large. When the image frames are obtained while the camera is in motion, we can use constraints about the scene and the camera. In this paper we propose a contour matching algorithm which guarantees an accurate matching result, even for large motion contours. The key id...

متن کامل

Accommodation in Binocular Contour Rivalry

Although contour rivalry is known to suppress the contribution of the non-dominant eye to some visuomotor mechanisms such as the pupillary light reflex, there have been no reports of the impact of rivalry on accommodation control. In the situation where the accommodation demands in the two eyes are in dynamic conflict, it has been reported that the accommodation response can be modelled in term...

متن کامل

Contour integration across depth

In order to investigate the extent of the local connections subserving contour integration across depth, we measured performance for detecting the continuity of a path of Gabor elements distributed in depth and embedded in a three-dimensional field of random background elements. The results show that performance cannot be explained in terms of monocular performance and that contour information ...

متن کامل

Binocular Brightness Averaging and Contour Information.

Binocular brightness averaging has been investigated under two conditions: with identical contour information in both eyes and with different contour information. Equibrightness curves are presented for the simple case, in which right and left test fields are identical in pat tern but different in luminance. These curves are for the most part linear; i.e. if the weighted sum of left and right l...

متن کامل

Subpixel contour matching using continuous dynamic programming

This paper presents a subpixel contour matching algorithm using a novel dynamic programming scheme. Unlike classical dynamic programming methods, where a discrete path is searched for across a graph, our approach allows the optimal continuous path to be determined. The matching is obtained as a piecewise para-metric fonction, and no discretization is involved, nor any parameterized deformation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Virtual Reality

سال: 2022

ISSN: ['1434-9957', '1359-4338']

DOI: https://doi.org/10.1007/s10055-022-00695-7